Minimum Entropy Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
A Cross-Entropy Based Algorithm for Combinatorial Optimization Problems
Cross Entropy has been recently applied to combinatorial optimization problems with promising results. This paper proposes a new cross-entropy based algorithm for monotonic integer programming problems with knapsack-type constraints. We show how the metaheuristic method can be adapted to tackle constrained problems, provided that some basic mathematical properties are enforced. Furthermore, som...
متن کاملA Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation
We present a new method, called the minimum cross-entropy (MCE) method for approximating the optimal solution of NP-hard combinatorial optimization problems and rare-event probability estimation, which can be viewed as an alternative to the standard cross entropy (CE) method. The MCE method presents a generic adaptive stochastic version of Kullback’s classic MinxEnt method. We discuss its simil...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملCombinatorial Optimization Problems with Testing
In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2011
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-011-9371-2